A Complete Multipartite Basis for the Chromatic Symmetric Function
نویسندگان
چکیده
In the vector space of symmetric functions, elements basis elementary functions are (up to a factor) chromatic disjoint unions cliques. We consider their graph complements, $\{r_{\lambda}: \lambda \text{ an integer partition}\}$ defined as complete multipartite graphs. This was first introduced by Penaguiao [21]. provide combinatorial interpretation for coefficients change-of-basis formula between $r_{\lambda}$ and monomial we show that Tutte $G$ when expanded in $r$-basis enumerate certain intersections partitions $V(G)$ into stable sets.
منابع مشابه
The Chromatic Symmetric Function of Almost Complete Graphs
The chromatic symmetric function of a graph is a symmetric function that generalizes the chromatic polynomial. Its investigation has largely been motivated by the existence of an open problem, the poset-chain conjecture, which is equivalent to the assertion that for certain graphs, the coefficients in the expansion of the chromatic symmetric function in terms of elementary symmetric functions, ...
متن کاملA Noncommutative Chromatic Symmetric Function
In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...
متن کاملA Quasisymmetric Function Generalization of the Chromatic Symmetric Function
The chromatic symmetric function XG of a graph G was introduced by Stanley. In this paper we introduce a quasisymmetric generalization X G called the k-chromatic quasisymmetric function of G and show that it is positive in the fundamental basis for the quasisymmetric functions. Following the specialization of XG to χG(λ), the chromatic polynomial, we also define a generalization χ k G(λ) and sh...
متن کاملA Chromatic Symmetric Function in Noncommuting Variables
In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...
متن کاملA Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in terms of the monomial symmetric functions, mλ, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1380314